منابع مشابه
Decomposing replicable functions
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
متن کاملReplicable functions: a computational approach
Methods for investigating replicable functions and a computer program which implements these methods are under development by the author. This research announcement contains the theoretical background of the method and the basic ideas of implementation.
متن کاملDecomposing bent functions
In a recent paper [1], it is shown that the restrictions of bent functions to subspaces of codimension 1 and 2 are highly nonlinear. Here, we present an extensive study of the restrictions of bent functions to affine subspaces. We propose several methods which are mainly based on properties of the derivatives and of the dual of a given bent function. We solve an open problem due to Hou [2]. We ...
متن کاملSUPER-REPLICABLE FUNCTIONS N (j1,N) AND PERIODICALLY VANISHING PROPERTY
We find the super-replication formulae which would be a generalization of replication formulae. And we apply the formulae to derive periodically vanishing property in the Fourier coefficients of the Hauptmodul N (j1,12) as a super-replicable function.
متن کاملDecomposing Symmetrically Continuous and Sierpiński-zygmund Functions into Continuous Functions
In this paper we will investigate the smallest cardinal number κ such that for any symmetrically continuous function f : R → R there is a partition {Xξ : ξ < κ} of R such that every restriction f Xξ : Xξ → R is continuous. The similar numbers for the classes of Sierpiński-Zygmund functions and all functions from R to R are also investigated and it is proved that all these numbers are equal. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2008
ISSN: 1461-1570
DOI: 10.1112/s1461157000000553